A Variable Neighborhood Search heuristic for rolling stock rescheduling

We present a Variable Neighborhood Search heuristic for the rolling stock rescheduling problem. Rolling is needed when disruption leads to cancellations in timetable. In rescheduling, one must then assign duties, i.e., sequences of trips, available train units such way that both passenger comfort and operational performance are taken into account. For our heuristic, we introduce three neighborhoods, which focus on swapping duties between units, improving individual changing shunting occurs respectively. These neighborhoods used Descent local search procedure perturbing current solution order escape from optima. Moreover, show can be extended setting flexible turnings at ending stations by introducing fourth neighborhood. apply instances Netherlands Railways (NS). The results able find high-quality solutions within 1 ​min solving time. This allows dispatchers use real-time rescheduling.